Vertex-Disjoint Copies of K1 + (K1 ∪K2) in Graphs
نویسندگان
چکیده
Let S denote the graph obtained from K4 by removing two edges which have an endvertex in common. Let k be an integer with k ≥ 2. Let G be a graph with |V (G)| ≥ 4k and σ2(G) ≥ |V (G)|/2 + 2k− 1, and suppose that G contains k vertex-disjoint triangles. In the case where |V (G)| = 4k+2, suppose further that G K4t+3 ∪ K4k−4t−1 for any t with 0 ≤ t ≤ k − 1. Under these assumptions, we show that G contains k vertex-disjoint copies of S. AMS 1991 Mathematics Subject Classification. 05C70.
منابع مشابه
Total vertex irregularity strength of corona product of some graphs
A vertex irregular total k-labeling of a graph G with vertex set V and edge set E is an assignment of positive integer labels {1, 2, ..., k} to both vertices and edges so that the weights calculated at vertices are distinct. The total vertex irregularity strength of G, denoted by tvs(G)is the minimum value of the largest label k over all such irregular assignment. In this paper, we study the to...
متن کاملEdge pair sum labeling of some cycle related graphs
Let G be a (p,q) graph. An injective map f : E(G) → {±1,±2,...,±q} is said to be an edge pair sum labeling if the induced vertex function f*: V (G) → Z - {0} defined by f*(v) = ΣP∈Ev f (e) is one-one where Ev denotes the set of edges in G that are incident with a vertex v and f*(V (G)) is either of the form {±k1,±k2,...,±kp/2} or {±k1,±k2,...,±k(p-1)/2} U {±k(p+1)/2} according as p is even or o...
متن کاملDegree-constrained 2-partitions of graphs
A (δ ≥ k1, δ ≥ k2)-partition of a graph G is a vertex-partition (V1, V2) of G satisfying that δ(G[Vi]) ≥ ki for i = 1, 2. We determine, for all positive integers k1, k2, the complexity of deciding whether a given graph has a (δ ≥ k1, δ ≥ k2)-partition. We also address the problem of finding a function g(k1, k2) such that the (δ ≥ k1, δ ≥ k2)-partition problem is NP-complete for the class of gra...
متن کاملForbidden Pairs for Vertex-Disjoint Claws
Let k ≥ 4, and let H1, H2 be connected graphs with |V (Hi)| ≥ 3 for i = 1, 2. A graph G is said to be {H1, . . . , Hl}-free if none of H1, . . . , Hl is an induced subgraph of G. We prove that if there exists a positive integer n0 such that every {H1, H2}-free graph G with |V (G)| ≥ n0 and δ(G) ≥ 3 contains k vertex-disjoint claws, then {H1, H2} ∩ {K1,t | t ≥ 2} = ∅. Also, we prove that every K...
متن کاملProducts of Regular Graphs are Antimagic
An antimagic labeling of a finite undirected simple graph with m edges and n vertices is a bijection from the set of edges to the integers 1, . . . ,m such that all n vertex sums are pairwise distinct, where a vertex sum is the sum of labels of all edges incident with the same vertex. A graph is called antimagic if it has an antimagic labeling. In 1990, Hartsfield and Ringel [5] conjectured tha...
متن کامل